Cyclic Block Designs With Block Size 3

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Halving block designs with block size four

B) is said to have the Size Four property if the blocks in B can be partitioned into two isomorphic sets. In this paper we construct block with four with the property, thus the exception of 6 A. Rosa [4]).

متن کامل

Concerning cyclic group divisible designs with block size three

We determine a necessary and sufficient condition for the existence of a cyclic {3}-GDD with a uniform group size 6n. This provides a fundamental class of ingredients for some recursive constructions which settle existence of k-rotational Steiner triple systems completely.

متن کامل

Cyclic Polygonal Designs with Block size 3 and Joint Distance 3

Polygonal designs, a class of partially balanced incomplete block designs with regular polygons, are useful in survey sampling in terms of balanced sampling plans excluding contiguous units (BSECs) and balanced sampling plans excluding adjacent units (BSAs) when neighboring units in a population provide similar information. In this paper, the method of cyclic shifts is used and cyclic polygonal...

متن کامل

Resolvable group divisible designs with block size 3

A group divisible design is resolvable if there exists a partition n = {P,, Pz, . .} of p such that each part Pi is itself a partition of X. In this paper we investigate the existence of resolvable group divisible designs with K = {3}, M a singleton set, and all A. The case where M = { 1) has been solved by Ray-Chaudhuri and Wilson for I = 1, and by Hanani for all h > 1. The case where M is a s...

متن کامل

Balanced incomplete block designs with block size~9: Part III

The necessary conditions for the existence of a balanced incomplete block design on v points, with index λ and block size k, are that: λ(v − 1) ≡ 0 mod (k − 1) λv(v − 1) ≡ 0 mod k(k − 1) Earlier work has studied k = 9 with λ ∈ {1, 2, 3, 4, 6, 8, 9, 12}. In this article we show that the necessary conditions are sufficient for λ = 9 and every other λ not previously studied.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: European Journal of Combinatorics

سال: 1981

ISSN: 0195-6698

DOI: 10.1016/s0195-6698(81)80017-0